On the membership problem for regular DNLC grammars

On the membership problem for regular DNLC grammars

On the Membership Problem for Non-Linear Abstract Categorial Grammars

In this paper we show that the membership problem for second order nonlinear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of λ-terms and presents an inter...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Polynomial Algorithm for the Membership Problem with Categorial Grammars

This article presents an overview of a framework called categorial grammars from a theoretical and algorithmic perspective. It provides an introduction to the formalisms of these grammars and of the tools they use (the Lambek Calculus) for theoretical computer scientists who are not familiar with them. We give a clear presentation of the main classical and recent results on these grammars, espe...

The Equivalence Problem for LL - and L / ? - Regular Grammars

The equivalence problem for context-free grammars is “given two arbitrary grammars, do they generate the same language ?” Since this is undecidable in general attention has been restricted to decidable subclasses of the context-free grammars. For example, the classes of U(k) grammars and real-time strict deterministic grammars. In this paper it is shown that the equivalence problem for U-regula...